-
1 graph closure
вчт замыкание графа -
2 graph closure
вчт. замыкание графаThe New English-Russian Dictionary of Radio-electronics > graph closure
-
3 closure
1) замыкание потока ( вектора)2) замыкание (напр. множества)3) вчт клауза, замкнутое выражение ( без свободных переменных)5) крышка; пробка; затвор•- flux closure
- graph closure
- reflexive closure
- relation closure
- symmetric closure
- transitive closure -
4 closure
1) замыкание потока ( вектора)2) замыкание (напр. множества)3) вчт. клауза, замкнутое выражение ( без свободных переменных)5) крышка; пробка; затвор•- flux closure
- graph closure
- reflexive closure
- relation closure
- symmetric closure
- transitive closureThe New English-Russian Dictionary of Radio-electronics > closure
-
5 domain
1) владение, имение2) территория, зона3) физ. домен4) область, сфера5) матем. область определения6) область, домен• -
6 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
7 complete
1) завершать
2) выполнять
3) достраивать
4) завершить
5) заканчивать
6) комплектный
7) укомплектовывать
8) полный
9) завершенный
10) законченный
11) комплектировать
12) комплектовать
13) наследственный
14) отработать
15) пополненный
16) совершенный
17) тотальный
18) необратимый
– complete an operation
– complete analysis
– complete applicability
– complete circuit
– complete closure
– complete code
– complete combustion
– complete compilation
– complete continuity
– complete control
– complete decarburization
– complete failure
– complete file
– complete fusion
– complete graph
– complete induction
– complete inflammation
– complete integral
– complete integration
– complete inversion
– complete license
– complete modulation
– complete mold
– complete normality
– complete operation
– complete ordering
– complete polygon
– complete quadrangle
– complete radiator
– complete revolutions
– complete series
– complete set
– complete similitude
– complete the square
– complete unit
– complete weld
– complete with
– functionally complete
– holomorphically complete
axiom of complete induction — аксиома математической индукции
complete regenerative cycle — предельный регенеративный цикл
equationally complete extension — эквационально полное расширение
-
8 algebra
algebra with minimality condition — алгебра с условием минимальности, алгебра с условием обрыва убывающих цепей
algebra with maximality condition — алгебра с условием максимальности, алгебра с условием обрыва возрастающих цепей
См. также в других словарях:
Closure with a twist — is a property of subsets of an algebraic structure. A subset Y of an algebraic structure X is said to exhibit closure with a twist if for every two elements there exists an automorphism ϕ of X and an element such that … Wikipedia
Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… … Wikipedia
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Transitive closure — In mathematics, the transitive closure of a binary relation R on a set X is the smallest transitive relation on X that contains R .For example, if X is a set of airports and xRy means there is a direct flight from airport x to airport y , then… … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … Wikipedia
Universal graph — In mathematics, a universal graph is an infinite graph that contains every finite (or at most countable) graph as an induced subgraph. A universal graph of this type was first constructed by R. Rado [cite journal author = Rado, R. title =… … Wikipedia
Dependency graph — In mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other. It is possible to derive an evaluation order or the absence of an evaluation order… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Transitive reduction — In mathematics, the transitive reduction of a binary relation R on a set X is a minimal relation R on X such that the transitive closure of R is the same as the transitive closure of R . If the transitive closure of R is antisymmetric and finite … Wikipedia
